On approximation by Function having a strong Entropy Point
نویسندگان
چکیده
منابع مشابه
Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملApproximation of a Fuzzy Function by Using Radial Basis Functions Interpolation
In the present paper, Radial Basis Function interpolations are applied to approximate a fuzzy function $tilde{f}:Rrightarrow mathcal{F}(R)$, on a discrete point set $X={x_1,x_2,ldots,x_n}$, by a fuzzy-valued function $tilde{S}$. RBFs are based on linear combinations of terms which include a single univariate function. Applying RBF to approximate a fuzzy function, a linear system wil...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولA Cross Entropy based Stochastic Approximation Algorithm for Reinforcement Learning with Linear Function Approximation
In this paper, we provide a new algorithm for the problem of prediction in Reinforcement Learning, i.e., estimating the Value Function of a Markov Reward Process (MRP) using the linear function approximation architecture, with memory and computation costs scaling quadratically in the size of the feature set. The algorithm is a multi-timescale variant of the very popular Cross Entropy (CE) metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tatra Mountains Mathematical Publications
سال: 2014
ISSN: 1210-3195
DOI: 10.2478/tmmp-2014-0007